On short cycles through prescribed vertices of a polyhedral graph
نویسنده
چکیده
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane triangulation are proved.
منابع مشابه
On long cycles through four prescribed vertices of a polyhedral graph
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length at least 1 36 c + 20 3 through any four vertices of G.
متن کاملOn short cycles through prescribed vertices of a graph
For c 2 and k minfc; 3g, guaranteed upper bounds on the length of a shortest cycle through k prescribed vertices of a c-connected graph are proved. Analogous results on planar graphs are presented, too.
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملOn generalized atom-bond connectivity index of cacti
The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for ABCa index for cacti of order $n$ ...
متن کاملFlexibility of Subdivided Polyhedral Complexes
A subdivided polyhedron is the graph obtained by adding vertices on some of the edges of the 1-skeleton of a polyhedron. We also consider subdivided polyhedral complexes, which are collections of polyhedra connected into a topological complex along faces (as in a beehive). We use these graphs to define abstract molecules, by placing atoms at the vertices and bonds along the edges. One of the si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 25 شماره
صفحات -
تاریخ انتشار 2005